Non - Stationary Parallel Multisplitting Aor Methods ∗
نویسندگان
چکیده
Non-stationary parallel multisplitting iterative methods based on the AOR method are studied for the solution of nonsingular linear systems. Convergence of the synchronous and asyn-chronous versions of these methods is studied for H–matrices. Furthermore, computational results about these methods on both shared and distributed memory multiprocessors are discussed. The numerical examples presented cover the non-stationary parallel multisplitting Gauss-Seidel and SOR methods applied to the solution of the linear system yielded by a finite difference discretization of the two-dimensional Laplace's equation on a rectangular domain under Dirichlet boundary conditions. These results show that non-stationary AOR-type methods (synchronous and asynchronous) are better than the corresponding standard parallel multisplitting AOR method. Moreover, asynchronous versions always behave better than the synchronous ones. 1. Introduction. In this paper we present non-stationary synchronous and asynchronous algorithms based on the multisplitting accelerated overrelaxation (AOR) method for the solution of large linear systems of the form
منابع مشابه
Non-stationary Parallel Multisplitting Two-Stage Iterative Methods with Self-AdaptiveWeighting Schemes
In this paper, we study the non-stationary parallel multisplitting two-stage iterative methods with selfadaptive weighting matrices for solving a linear system whose coefficient matrix is symmetric positive definite. Two choices of Self-adaptive weighting matrices are given, especially, the nonnegativity is eliminated. Moreover, we prove the convergence of the non-stationary parallel multisplit...
متن کاملConvergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices
Non-stationary multisplitting algorithms for the solution of linear systems are studied. Convergence of these algorithms is analyzed when the coefficient matrix of the linear system is hermitian positive definite. Asynchronous versions of these algorithms are considered and their convergence investigated.
متن کاملGRPM-style methods and comparisons of convergent and divergent rates
Relaxed technique is one of techniques for improving convergence rate of splitting iterative methods. Based on local relaxed method and system relaxed method of parallel multisplitting Frommer andMayer [A. Frommer, G. Mayer, Convergence of relaxed parallel multisplitting methods, Linear Algebra Appl. 119 (1989) 141–152], we give the global relaxed parallel multisplitting (GRPM) method by introd...
متن کاملNonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
متن کاملGlobal Modulus-Based Synchronous Multisplitting Multi-Parameters TOR Methods for Linear Complementarity Problems
In 2013, Bai and Zhang constructed modulus-based synchronous multisplitting methods for linear complementarity problems and analyzed the corresponding convergence. In 2014, Zhang and Li studied the weaker convergence results based on linear complementarity problems. In 2008, Zhang et al. presented global relaxed non-stationary multisplitting multi-parameter method by introducing some parameters...
متن کامل